The structure of a finitely generated Kleinian group
نویسندگان
چکیده
منابع مشابه
The limit set intersection theorem for finitely generated Kleinian groups
The proof of the Theorem proceeds by showing that it holds in some special cases involving Kleinian groups with connected limit sets, and then extending to the general case by using a decomposition argument based on the Klein-Maskit combination theorems and a careful tracking of the limit points resulting from this decomposition. We discuss various well-behaved classes of limit points in Sectio...
متن کاملA characterization of finitely generated multiplication modules
Let $R$ be a commutative ring with identity and $M$ be a finitely generated unital $R$-module. In this paper, first we give necessary and sufficient conditions that a finitely generated module to be a multiplication module. Moreover, we investigate some conditions which imply that the module $M$ is the direct sum of some cyclic modules and free modules. Then some properties of Fitting ideals o...
متن کاملThe Modular Group A Finitely Generated Group with Interesting Subgroups
The action of Möbius transformations with real coefficients preserves the hyperbolic metric in the upper half-plane model of the hyperbolic plane. The modular group is an interesting group of hyperbolic isometries generated by two Möbius transformations, namely, an order-two element, g2 HzL = -1 ê z, and an element of infinite order, g• HzL = z + 1. Viewing the action of the group elements on a...
متن کاملPeriodic rings with finitely generated underlying group
We study periodic rings that are finitely generated as groups. We prove several structure results. We classify periodic rings that are free of rank at most 2, and also periodic rings R such that R is finitely generated as a group and R/t(R) Z. In this way, we construct new classes of periodic rings. We also ask a question concerning the connection to periodic rings that are finitely generated a...
متن کاملRandom Generation of Finitely Generated Subgroups of a Free Group
We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertices of its representation by a reduced graph such as can be obtained by the method of Stallings foldings. Our algorithm randomly generates a subgroup of a given size n, according to the uniform distribution over size n ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Mathematica
سال: 1969
ISSN: 0001-5962
DOI: 10.1007/bf02392006